#include <bits/stdc++.h>

using namespace std;

class Solution {
public:
private:
};

int compare_ints(const void* a, const void* b);

int main()
{
	int n, m;
	scanf("%d%*s%d", &n, &m);
	/* unique_ptr<int[]> arr { new int[n] }; */
	int* arr = (int*)malloc(n * sizeof(int));
	for (int i = 0; i < n; i++)
		scanf("%d", arr + i);
	qsort(arr, n, sizeof(int), compare_ints);
	int lo = 0, hi = arr[n - 1] - arr[0];
	while (lo < hi) {
		int mid = lo + (hi - lo >> 1);
		if (check(mid)) lo = lo + 1;
		else hi = mid;
	}
	/* [[maybe_unused]] Solution solution; */
	free(arr);
	return 0;
}

int compare_ints(const void* a, const void* b)
{
	int arg1 = *(const int*)a, arg2 = *(const int*)b;
	return (arg1 > arg2) - (arg1 < arg2); // 可行的简写
}
